Noisy colored point set matching
نویسندگان
چکیده
منابع مشابه
Noisy Bottleneck Colored Point Set Matching in 3D
In this paper we tackle the problem of matching two colored point sets in R under the bottleneck distance. First we present an exact matching algorithm that requires the computation of intersections of complex algebraic surfaces. To avoid this, we also present an approximate algorithm that is implementable and has improved asymptotic cost at the price of having the risk of ”missing” some soluti...
متن کاملEfficient Colored Point Set Matching Under Noise
Let A and B be two colored point sets in R2, with |A| ≤ |B|. We propose a process for determining matches, in terms of the bottleneck distance, betweenA and subsets of B under color preserving rigid motion, assuming that the position of all colored points in both sets contains a certain amount of ”noise”. The process consists of two main stages: a lossless filtering algorithm and a matching alg...
متن کاملColored Point Set Matching Under Noise in 3D
Let A and B be two colored points sets in R, with |A| ≤ |B|. We propose a process for determining matches, in terms of the bottleneck distance, between A and subsets of B under color preserving rigid motion, assuming that the position of all colored points in both sets contains a certain amount of ”noise”. Our algorithm consists of two main stages. In the first one we generate all, up to a cert...
متن کاملColored Point-Set Embeddings of Acyclic Graphs
We show that any planar drawing of a forest of three stars whose vertices are constrained to be at fixed vertex locations may require Ω(n 2 3 ) edges each having Ω(n 1 3 ) bends in the worst case. The lower bound holds even when the function that maps vertices to points is not a bijection but it is defined by a 3-coloring. In contrast, a constant number of bends per edge can be obtained for 3-c...
متن کاملPoint-Set Embeddability of 2-Colored Trees
In this paper we study bichromatic point-set embeddings of 2-colored trees on 2-colored point sets, i.e., point-set embeddings of trees (whose vertices are colored red and blue) on point sets (whose points are colored red and blue) such that each red (blue) vertex is mapped to a red (resp. blue) point. We prove that deciding whether a given 2-colored tree admits a bichromatic point-set embeddin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2011
ISSN: 0166-218X
DOI: 10.1016/j.dam.2010.12.006